Using a Neighbourhood Graph Based on Voronoï Tessellation with DMOS, a Generic Method for Structured Document Recognition
نویسندگان
چکیده
To develop a method for structured document recognition, it is necessary to know the relative position of the graphical elements in a document. In order to deal with this notion, we build a neighbourhood graph based on Voronoı̈ tessellation. We propose to combine the use of this interesting notion of neighbourhood with an existing generic document recognition method, DMOS, which has been used to describe various kinds of documents. This association allows exploiting different aspects of the neighbourhood graph, separating the graph analysis from the knowledge linked to a kind of document. Thus, we set up a cooperation between neighbourhood graph, that contains numerical information, and DMOS method, that can convert this data into symbolic information. Moreover, DMOS method can specify a context of analysis when exploiting neighbourhood graph, which makes it possible to establish a bidirectional relation between the analyser and the graph. We apply this method on the analysis of various documents.
منابع مشابه
Using a Neighbourhood Graph Based on Voronöı Tessellation with DMOS, a Generic Method for Structured Document Recognition
To develop a method for structured document recognition, it is necessary to know the relative position of the graphical elements in a document. In order to deal with this notion, we build a neighbourhood graph based on Voronöı tessellation. We propose to combine the use of this interesting notion of neighbourhood with an existing generic document recognition method, DMOS, which has been used to...
متن کاملProtein secondary structure assignment through Voronoï tessellation.
We present a new automatic algorithm, named VoTAP (Voronoï Tessellation Assignment Procedure), which assigns secondary structures of a polypeptide chain using the list of alpha-carbon coordinates. This program uses three-dimensional Voronoï tessellation. This geometrical tool associates with each amino acid a Voronoï polyhedron, the faces of which unambiguously define contacts between residues....
متن کاملVoronoï tessellation reveals the condensed matter character of folded proteins.
The packing geometry of amino acids in folded proteins is analyzed via a modified Voronoï tessellation method which distinguishes bulk and surface. From a statistical analysis of the Voronoï cells over 40 representative proteins, it appears that the packings are in average similar to random packings of hard spheres encountered in condensed matter physics, with a quite strong fivefold local symm...
متن کاملرفع اعوجاج هندسی متون بهکمک اطلاعات هندسی خطوط متن
Document images produced by scanners or digital cameras usually have photometric and geometric distortions. If either of these effects distorts document, recognition of words from such a document image using OCR is subject to errors. In this paper we propose a novel approach to significantly remove geometric distortion from document images. In this method first we extract document lines from do...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کامل